Convolution products with small Fourier-Stieltjes transforms
نویسندگان
چکیده
منابع مشابه
Integral Transforms of Fourier Cosine Convolution Type
which has the following property Fc(f ∗ g)(x) = (Fcf)(x)(Fcg)(x). (3) The theory of integral transforms related to the Fourier and Mellin convolutions is well developed [2, 6, 10, 11, 12, 13, 19] and has many applications. Some other classes of integral transforms, that are not related to any known convolutions, are considered in [14, 15]. In this paper we investigate integral transforms of the...
متن کاملIntegral transforms, convolution products, and first variations
We establish the various relationships that exist among the integral transform Ᏺ α,β F , the convolution product (F * G) α , and the first variation δF for a class of functionals defined on K[0,T ], the space of complex-valued continuous functions on [0,T ] which vanish at zero. 1. Introduction and definitions. In a unifying paper [10], Lee defined an integral transform Ᏺ α,β of analytic functi...
متن کاملRepresentation of Functions as Absolutely Convergent Fourier-stieltjes Transforms
0. Introduction. Let G be a locally compact Abelian group, and G* its group of (continuous) characters. We write (y, x) to indicate the function on G*XG which is the value of the character y EG* at the point *6G, or, dually, the value of the character xEG at the point y EG*. Borel sets in G are taken to be the smallest cr-algebra of sets containing all closed sets. We consider the set of all re...
متن کاملCosine Products, Fourier Transforms, and Random Sums
one gets the first actual formula for 7r that mankind ever discovered, dating from 1593 and due to Frangois Viete (1540-1603), whose Latinized name is Vieta. (Was any notice taken of the formula's 400th anniversary, perhaps by the issue of a postage stamp?) From the samples of a function t(x) at equally spaced points x", n E z, one can reconstruct the complete function with the aid of sin x/x, ...
متن کاملFast Fourier Transforms for Wreath Products
In this paper fast Fourier transform algorithms (FFT's) are constructed for wreath products of the form GS n ]. Examples of interest include the hyperoctahedral groups B n (the symmetry groups of the n-cube) as well as more generally AS n ] for any abelian groups A and also the full wreath products S m S n ] and their iterates, often identiied as automorphism groups of spherically homogeneous r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1975
ISSN: 0019-2082
DOI: 10.1215/ijm/1256050925